SUNNY-CP and the MiniZinc challenge
نویسندگان
چکیده
In Constraint Programming (CP) a portfolio solver combines a variety of different constraint solvers for solving a given problem. This fairly recent approach enables to significantly boost the performance of single solvers, especially when multicore architectures are exploited. In this work we give a brief overview of the portfolio solver sunny-cp, and we discuss its performance in the MiniZinc Challenge—the annual international competition for CP solvers—where it won two gold medals in 2015 and 2016. Under consideration in Theory and Practice of Logic Programming (TPLP)
منابع مشابه
SUNNY with Algorithm Configuration
The SUNNY algorithm is a portfolio technique originally tailored for Constraint Satisfaction Problems (CSPs). SUNNY allows to select a set of solvers to be run on a given CSP, and was proven to be effective in the MiniZinc Challenge, i.e., the yearly international competition for CP solvers. In 2015, SUNNY was compared with other solver selectors in the first ICON Challenge on algorithm selecti...
متن کاملMiniZinc: Towards a Standard CP Modelling Language
There is no standard modelling language for constraint programming (CP) problems. Most solvers have their own modelling language. This makes it difficult for modellers to experiment with different solvers for a problem. In this paper we present MiniZinc, a simple but expressive CP modelling language which is suitable for modelling problems for a range of solvers and provides a reasonable compro...
متن کاملImproved Linearization of Constraint Programming Models
Constraint Programming (CP) standardizes many specialized “global constraints” allowing high-level modelling of combinatorial optimization and feasibility problems. Current Mixed-Integer Linear Programming (MIP) technology lacks both a modelling language and a solving mechanism based on high-level constraints. MiniZinc is a solver-independent CP modelling language. The solver interface works by...
متن کاملThe Evolving World of MiniZinc
MiniZinc arose as a response to the extended discussion at CP2006 of the need for a standard modelling language for CP. This is a challenging problem, and we believe MiniZinc makes a good attempt to handle the most obvious obstacle: there are hundreds of potential global constraints, most handled by few or no systems. We have now used MiniZinc for 2 years, and learnt a lot about its strengths a...
متن کاملEmbedding MiniZinc?
MiniZinc is an expressive, mid-level modelling language for combinatorial optimisation problems. Its main advantage over other modelling languages and systems is the approach towards solver-independent modelling: it comes with an extensive library of global constraints that are supported by all MiniZinc-compatible solvers – either through decomposition, or as a native builtin constraint of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- TPLP
دوره 18 شماره
صفحات -
تاریخ انتشار 2018